翻訳と辞書 |
Bishop–Cannings theorem : ウィキペディア英語版 | Bishop–Cannings theorem The Bishop–Cannings theorem is a theorem in evolutionary game theory. It states that (i) all members of a mixed evolutionarily stable strategy (ESS) have the same payoff (Theorem 2), and (ii) that none of these can also be a pure ESS〔Bishop, D.T. and Cannings, C. (1978). (A generalized war of attrition ). ''Journal of Theoretical Biology'' 70:85–124.〕 (from their Theorem 3). The usefulness of the results comes from the fact that they can be used to directly find ESSes algebraically, rather than simulating the game and solving it by iteration. The logic of (i) also applies to Nash equilibria (all strategies in the support of a mixed strategy receive the same payoff). The theorem was formulated by Tim Bishop and Chris Cannings at Sheffield University, who published it in 1978. A review is given by John Maynard Smith in ''Evolution and the Theory of Games'', with proof in the appendix.〔Maynard Smith, J. 1982 ''Evolution and the Theory of Games'', Cambridge University Press.〕 ==Notes== 〔
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Bishop–Cannings theorem」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|